Greedy Algorithms for Optimal Distribution Approximation
نویسندگان
چکیده
منابع مشابه
Greedy Algorithms for Optimal Distribution Approximation
The approximation of a discrete probability distribution t by an M -type distribution p is considered. The approximation error is measured by the informational divergence D(t‖p), which is an appropriate measure, e.g., in the context of data compression. Properties of the optimal approximation are derived and bounds on the approximation error are presented, which are asymptotically tight. It is ...
متن کاملGreedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k-extendible systems, a natural generalization of matroids, and show that a greedy algorithm is a 1 k -factor approximation for these systems. Many seemly unrelated problems fit in our framework, e.g.: b-matching, maxi...
متن کاملPhase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, solutions of underdetermined linear systems of equations. Many such algorithms have now been proven using the ubiquitous Restricted Isometry Property (RIP) [9] to have optimal-order uniform recovery guarantees. However,...
متن کاملSimultaneous approximation by greedy algorithms
We study nonlinear m-term approximation with regard to a redundant dictionary D in a Hilbert space H. It is known that the Pure Greedy Algorithm (or, more generally, the Weak Greedy Algorithm) provides for each f ∈ H and any dictionary D an expansion into a series f = ∞ X j=1 cj(f)φj(f), φj(f) ∈ D, j = 1, 2, . . . with the Parseval property: ‖f‖2 = j |cj(f)|. Following the paper of A. Lutoborsk...
متن کاملGreedy approximation algorithms for directed multicuts
The Directed Multicut (DM) problem is: given a simple directed graph G = (V ,E) with positive capacities ue on the edges, and a set K ⊆ V × V of ordered pairs of nodes of G, find a minimum capacity K-multicut; C ⊆ E is a K-multicut if in G − C there is no (s, t)-path for any (s, t) ∈ K. In the uncapacitated case (UDM) the goal is to find a minimum size K-multicut. The best approximation ratio k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2016
ISSN: 1099-4300
DOI: 10.3390/e18070262